Some Comments on the Strong Simplex Conjecture

نویسندگان

  • Dejan E. Lazich
  • Christian Senger
  • Martin Bossert
چکیده

In the disproof of the Strong Simplex Conjecture presented in [1], a counterexample signal set was found that has higher average probability of correct optimal decoding than the corresponding regular simplex signal set, when compared at small values of the signal-to-noise ratio. The latter was defined as the quotient of average signal energy and average noise power. In this paper, it is shown that this interpretation of the signal-to-noise ratio is inappropriate for a comparison of signal sets, since it leads to a contradiction with the Channel Coding Theorem. A modified counterexample signal set is proposed and examined using the classical interpretation of the signal-to-noise ratio, i.e., as the quotient of average signal energy and average noise energy. This signal set outperforms the regular simplex signal set for small signal-to-noise ratios without contradicting the Channel Coding Theorem, hence the Strong Simplex Conjecture remains proven false.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic iterative algorithms for signal set design for Gaussian channels and optimality of the L2 signal set

We propose a stochastic iteration approach to signal set design. Four practical stochastic iterative algorithms are proposed with respect to equal and average energy constraints and sequential and batch modes. By simulation, a new optimal signal set, the L2 signal set (consisting of a regular simplex set of three signals and some zero signals), is found under the strong simplex conjecture (SSC)...

متن کامل

On some generalisations of Brown's conjecture

Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|

متن کامل

Some difference results on Hayman conjecture and uniqueness

In this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite Picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on Hayman conjecture. We also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...

متن کامل

$L^p$-Conjecture on Hypergroups

In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions  for a weighted Lebesgue space  $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$.  Among the other things, we also show that if $K$ is a locally compact hyper...

متن کامل

The strong simplex conjecture is false

The design of M average-energy-constrained signals in additive white Gaussian noise is addressed. The long-standing strong simplex conjecture, which postulates that the regular simplex signal set maximizes the probability of correct detection under an average-energy constraint, is disproven. A signal set is presented that performs better than the regular simplex signal set at low signal-to-nois...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1202.1081  شماره 

صفحات  -

تاریخ انتشار 2012